Notes on Fibonacci Partitions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Fibonacci Partitions

Abstract. Let f1 = 1, f2 = 2, f3 = 3, f4 = 5, . . . be the sequence of Fibonacci numbers. It is well known that for any natural n there is a unique expression n = fi1 + fi2 + · · · + fiq , such that ia+1 − ia > 2 for a = 1, 2, . . . , q− 1 (Zeckendorf Theorem). By means of it we find an explicit formula for the quantity Fh(n) of partitions of n with h summands, all parts of them are the pairwis...

متن کامل

Fibonacci Partitions

Then f(z) is also an analytic function without zeros on compact subsets of the unit disk. We have A * ) = n o * * ) 1 = z v < °=0(4) «>1 «>0 Definition 1: Let r(#)? r^(n), r0(w) denote, respectively, the number of partitions of n into distinct parts, evenly many distinct parts, oddly many distinct parts from {un}. Let r (0) = rE(0) = l, r0(0) = 0. If an =rE(n)-rQ(n)9 then U„ is the number of pa...

متن کامل

Graphs, partitions and Fibonacci numbers

The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...

متن کامل

Notes on higher-dimensional partitions

We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the number of particular types of skew Ferrers diagrams. The end result of our analysis is the existence of a triangle, that we denote by F , which implies that the d...

متن کامل

Compositions, Partitions, and Fibonacci Numbers

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2016

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2015.1118416